A modular cost analysis for probabilistic programs
نویسندگان
چکیده
منابع مشابه
Restricted demonic choice for modular probabilistic programs
It is argued that one approach to modularity in programs containing both demonic and probabilistic choice is to allow variations on the former: `restricted demonic choice', written u L , is not allowed to use the value of variables named in the set L as it resolves its nondeterminism; ordinary demonic choice u is then just the special case u fg in which the set of hidden variables is empty. The...
متن کاملCost-Based Analysis of Probabilistic Programs Mechanised in HOL
We provide a HOL formalisation for analysing expected time bounds for probabilistic programs. Our formalisation is based on the quantitative program logic of Morgan et al. [20] and McIver’s extension of it [16] to include performancestyle operators. In addition we provide some novel results based on probabilistic data refinement which we use to improve the utility of the basic method.
متن کاملModular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard operational semantics which places certain restrictions on aliasing and sharing across modules. More specifically, we assume that live references (i.e., used before set) between subheaps manipulated by different modules ...
متن کاملModular Heap Analysis for Higher-Order Programs
We consider the problem of computing summaries for procedures that soundly capture the effect of calling a procedure on program state that includes a mutable heap. Such summaries are the basis for a compositional program analysis and key to scalability. Higher order procedures contain callbacks (indirect calls to procedures specified by callers). The use of such callbacks and higherorder featur...
متن کاملBounded Expectations: Resource Analysis for Probabilistic Programs
Following the increasing relevance of probabilistic programming, there is a renewed interest in addressing the challenges that probabilistic code bears for static reasoning. For example, there are successful techniques for automatic worst-case resource analysis but these techniques are not applicable to many probabilistic programs, which, for instance, only terminate almost surely. This paper p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3428240